Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
131	Comparing Complexity of API Designs: An Exploratory Experiment on DSL-based Framework Integration Stefan Sobernig Patrick Gaubatz Add to Reading List Source URL: wi.wu.ac.at Language: English - Date: 2015-02-14 09:46:22 Object-oriented programming Software design Programming paradigms Aspect-oriented programming Domain-specific language Security Assertion Markup Language Application programming interface Class Java Architecture for XML Binding Software engineering Computing Computer programming
132	How I Entered Constraints (and Met Ugo at the Doorway): Some of the Early Milestones Rina Dechter UC-Irvine Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2008-09-08 14:27:27 Software engineering Local consistency Flow network A* search algorithm Heuristic Constraint Decomposition method Complexity of constraint satisfaction Constraint programming Artificial intelligence Graph theory
133	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 A Constant-Factor Approximation for Maximum Weight Triangulation Shiyan Hu∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:37 Applied mathematics Minimum-weight triangulation Minimum spanning tree Dynamic programming Time complexity Delaunay triangulation Point set triangulation Triangulation Theoretical computer science Mathematics
134	Microsoft Word - OpPrincAndPF.doc Add to Reading List Source URL: mcs.open.ac.uk Language: English - Date: 2009-10-24 06:02:45 Systems science Problem frames approach Systems analysis Problem solving Communications protocol Complexity Software design Pendulum clock Dynamic programming Science Systems theory Systems engineering
135	The 118th RCKC Colloquium Search Result Diversification via Filling up Multiple Knapsacks Yu Haitao Add to Reading List Source URL: www.tsukuba.ac.jp Language: English - Date: 2014-12-09 20:27:32 Applied mathematics Combinatorial optimization Cryptography Dynamic programming Knapsack problem Mathematical optimization Optimization problem Recommender system Theoretical computer science Computational complexity theory Operations research
136	There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-12-30 12:50:07 Dynamic programming Operations research Complexity classes Approximation algorithms Polynomial-time approximation scheme Knapsack problem Subset sum problem Parameterized complexity Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
137	Constraints DOIs10601The Complexity of Reasoning with Global Constraints Christian Bessiere · Emmanuel Hebrard · Brahim Hnich · Toby Walsh Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:29 Applied mathematics Mathematical optimization Local consistency Constraint satisfaction NP-complete Computational complexity theory P versus NP problem NP Complexity of constraint satisfaction Constraint programming Theoretical computer science Complexity classes
138	Parameterized Algorithms for Graph Partitioning Problems Hadas Shachnai and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {hadas,meizeh}@cs.technion.ac.il Abstract. We study a broad class of Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:35:59 NP-complete problems Combinatorial optimization Dynamic programming Mathematical optimization Operations research Optimal control Connectivity Tree decomposition Parameterized complexity Theoretical computer science Graph theory Mathematics
139	Some Principles and Ideas of PFA: the Problem Frames Approach (Draft of 30th JanuaryMichael Jackson, The Open University Abstract Add to Reading List Source URL: mcs.open.ac.uk Language: English - Date: 2009-02-01 06:18:16 Problem frames approach Systems analysis Systems science Software design Decomposition Complexity Domain Decomposition method Dynamic programming Systems theory Systems engineering Software development
140	Potential and Challenges of Two-VariablePer-Inequality Sub-Polyhedral Compilation Ramakrishna Upadrasta Albert Cohen INRIA and LRI, Paris-Sud 11 University Add to Reading List Source URL: perso.ens-lyon.fr Language: English - Date: 2011-03-29 07:21:24 Operations research Computational complexity theory Convex optimization Linear programming Polyhedron Mathematical optimization Approximation algorithm Simplex algorithm Algorithm Theoretical computer science Applied mathematics Mathematics